Parallel Metaheuristics
نویسندگان
چکیده
Metaheuristic parallel search methods { tabu search, simulated annealing and genetic algorithms, essentially { are reviewed, classi ed and examined not according to particular methodological characteristics, but following the unifying approach of the level of parallelization. It is hoped that by examining the commonalities among parallel implementations across the eld of metaheuristics, insights may be gained, trends may be discovered, and research challenges may be identi ed. Particular attention is paid to applications of parallel metaheuristics to transportation problems.
منابع مشابه
OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملUsing Metaheuristics in a Parallel Computing Course
In this paper the use of metaheuristics techniques in a parallel computing course is explained. In the practicals of the course different metaheuristics are used in the solution of a mapping problem in which processes are assigned to processors in a heterogeneous environment, with heterogeneity in computation and in the network. The parallelization of the metaheuristics is also considered.
متن کاملStrategies for the Parallel Implementation of Metaheuristics∗
Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but they also lead to more robust algorithms. We review some trends in parallel computing and...
متن کاملPMF: A Multicore-Enabled Framework for the Construction of Metaheuristics for Single and Multiobjective Optimization
This paper describes the design and implementation of the Parallel Metaheuristics Framework (PMF), a C++ framework for the construction of single and multiobjective metaheuristics utilizing Intel’s Threading Building Blocks library to allow easy parallelization of computationally intensive algorithms. The framework demonstrates a generic approach to the construction of metaheuristics, striving ...
متن کاملA New Cooperative Framework for Parallel Trajectory-Based Metaheuristics
In this paper, we propose the Parallel Elite Biased framework (PEB framework) for parallel trajectory-based metaheuristics. In the PEB framework, multiple search processes are executed concurrently. During the search, each process sends its best found solutions to its neighboring processes and uses the received solutions to guide its search. Using the PEB framework, we design a parallel variant...
متن کامل